Analyzing linear recursive projects as an absorbing chain

نویسندگان

  • Do L. Minh
  • R. Bhaskar
چکیده

Project management is usually calculated as a set of static activities, whereas in reality these activities tend to be dynamic involving multiple feedbacks (Park and Peña-Mora [5]). This results in many late project completions. Recently research has been done to formulate and analyze various methods to improve project prediction and control. These include concurrent engineering (Carter and Baker [1]) and stage-gate systems (Cooper [2]) in which projects must meet specifications before they pass from one stage to another. The activities within a project are governed by constraints as well as precedence relationships in traditional network scheduling like CPM (critical path method, Dupont Inc. and Remington Rand, 1958), PDM (procedure diagramming method, IBM Co., 1964) and PERT (program evaluation and review technology, US Navy, Booz-Allen Hamilton and Lockheed Co. 1958).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Absorbing Markov Chain Models to Determine Optimum Process Target Levels in Production Systems with Rework and Scrapping

In this paper, absorbing Markov chain models are developed to determine the optimum process mean levels for both a single-stage and a serial two-stage production system in which items are inspected for conformity with their specification limits. When the value of the quality characteristic of an item falls below a lower limit, the item is scrapped. If it falls above an upper limit, the item is ...

متن کامل

Arrival probability in the stochastic networks with an established discrete time Markov chain

The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...

متن کامل

AIOSC: Analytical Integer Word-length Optimization based on System Characteristics for Recursive Fixed-point LTI Systems

The integer word-length optimization known as range analysis (RA) of the fixed-point designs is a challenging problem in high level synthesis and optimization of linear-time-invariant (LTI) systems. The analysis has significant effects on the resource usage, accuracy and efficiency of the final implementation, as well as the optimization time. Conventional methods in recursive LTI systems suffe...

متن کامل

On the 2-absorbing Submodules

Let $R$ be a commutative ring and $M$ be an $R$-module. In this paper, we investigate some properties of 2-absorbing submodules of $M$. It is shown that $N$ is a 2-absorbing submodule of $M$ if and only if whenever $IJLsubseteq N$ for some ideals $I,J$ of R and a submodule $L$ of $M$, then $ILsubseteq N$ or $JLsubseteq N$ or $IJsubseteq N:_RM$. Also, if $N$ is a 2-absorbing submodule of ...

متن کامل

Stanford Artifical Intelligence Project Memoaim-167 Stan-cs-72-282 Efficient Compilation of Linear Recursive Programs

We consider the class of linear recursive programs. A linear recursive program is a set of procedures where each procedure can make at most one recursive call. The conventional stack implementation of recursion requires time and space both proportional to n, the depth of recursion. It is shown that in order to implement linear recursion so as to execute in time n one doesn't need space proporti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JAMDS

دوره 2006  شماره 

صفحات  -

تاریخ انتشار 2006